Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem
نویسندگان
چکیده
منابع مشابه
An Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملan effective ant colony algorithm for the traveling salesman problem
the traveling salesman problem (tsp) is a well-known combinatorial optimization problem and holds a central place in logistics management. the tsp has received much attention because of its practical applications in industrial problems. many exact, heuristic and metaheuristic approaches have been proposed to solve tsp in recent years. in this paper, a modified ant colony optimization (maco) is ...
متن کاملBiogeography Migration Algorithm for Traveling Salesman Problem
Biogeography-based optimization algorithm(BBO) is a new kind of optimization algorithm based on Biogeography. It is designed based on the migration strategy of animals to solve the problem of optimization. In this paper, a new algorithm-Biogeography Migration Algorithm for Traveling Salesman Problem(TSPBMA) is presented. Migration operator is designed. It is tested on four classical TSP problem...
متن کاملImmune-Genetic Algorithm for Traveling Salesman Problem
The Traveling Salesman Problem (TSP), first formulated as a mathematical problem in 1930, has been receiving continuous and growing attention in artificial intelligence, computational mathematics and optimization in recent years. TSP can be described as follows: Given a set of cities, and known distances between each pair of cities, the salesman has to find a shortest possible tour that visits ...
متن کاملA Lower Bound for Adjacencies on the Traveling Salesman Polytope
We study adjacency of vertices on Tn, the asymmetric traveling salesman polytope of degree n. Applying a result of G. Boccara [Discrete Math., 29 (1980), pp. 105–134] to permutation groups, we show that Tn has Ω((n− 1)(n− 2)! 2 logn) edges, implying that the degree of a vertex of Tn is Ω((n− 2)! logn). We conjecture the degree to be Ω((n− 2)!(logn)) for any positive integer k. We compute the de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Industry and Sustainable Development
سال: 2020
ISSN: 2682-4000
DOI: 10.21608/ijisd.2020.101626